1670D - Very Suspicious - CodeForces Solution

// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>

#define endl "\n"
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<int,int> PII;

const int N = 1000010;

int a[N];
ll T,n,m;
int dx[4] = {0,1,-1,0},dy[4] = {1,0,0,-1};


int main()
{
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	vector<int> ans;
	int mx = 0;
	int x = 0;
	priority_queue<int,vector<int>,greater<int>> heap;
	for(int i=0;i<3;i++) heap.push(0);
	
	while(x < 1e9+7){
		ans.push_back(x);
		int mn = heap.top();
		heap.pop();
		x += 2*(mx - mn);
		mx++;
		mn++;
		heap.push(mn);
	}
	cin >> T;
	while(T--){
		cin >> n;
		cout << lower_bound(ans.begin(),ans.end(),n) - ans.begin() << endl;
	}
	
    return 0;
}